package exercise.day12;

import java.util.Scanner;

/**
 * @author Dianzhi Han
 * @version 1.0
 * @description: TODO
 * @date 2022/11/19 0:38
 */
public class HJ60_SearchNearestPrime {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int n = in.nextInt();
            for(int i = n/2 ; i>0;i--){
                if(isPrime(i) && isPrime(n-i)){
                    System.out.println(i);
                    System.out.print(n-i);
                    break;
                }
            }
        }
    }

    public static boolean isPrime(int n){
        for(int i = 2;i*i<=n ; i++){
            if(n % i == 0){
                return false;
            }
        }
        return true;
    }
}
